Full Abstraction for HOPLA
نویسندگان
چکیده
A fully abstract denotational semantics for the higher-order process language HOPLA is presented. It characterises contextual and logical equivalence, the latter linking up with simulation. The semantics is a clean, domain-theoretic description of processes as downwards-closed sets of computation paths: the operations of HOPLA arise as syntactic encodings of canonical constructions on such sets; full abstraction is a direct consequence of expressiveness with respect to computation paths; and simple proofs of soundness and adequacy shows correspondence between the denotational and operational semantics.
منابع مشابه
Domain theory for concurrency
Concurrent computation can be given an abstract mathematical treatment very similar to that provided for sequential computation by domain theory and denotational semantics of Scott and Strachey. A simple domain theory for concurrency is presented. Based on a categorical model of linear logic and associated comonads, it highlights the role of linearity in concurrent computation. Two choices of c...
متن کاملNominal domain theory for concurrency
This paper investigates a methodology of using FM (FraenkelMostowski) sets, and the ideas of nominal set theory, to adjoin name generation to a semantic theory. By developing a domain theory for concurrency within FM sets the domain theory inherits types and operations for name generation, essentially without disturbing its original higherorder features. The original domain theory had a metalan...
متن کاملNew-HOPLA: A Higher-order Process Language with Name Generation
This paper introduces new-HOPLA, a concise but powerful language for higher-order nondeterministic processes with name generation. Its origins as a metalan-guage for domain theory are sketched but for the most part the paper concentrateson its operational semantics. The language is typed, the type of a process describingthe shape of the computation paths it can perform. Its ...
متن کاملARIADNE and HOPLa: Flexible Coordination of Collaborative Processes
The research into the Ariadne system and its coordination language HOPLa aims to provide generic support for hybrid collaborative processes. These are complex information processing tasks involving coordinated contributions from multiple people and tools. Ariadne should applicable for a broad spectrum of these processes and actively support people in working in these processes and in defining a...
متن کاملStrong Correspondence for HOPLA
We show that the operational semantics for HOPLA is in strong correspondence with its presheaf semantics [2, 1]. The proof is a fairly standard logical relations proof, exploiting the path semantics of the language [3, 4]. Strong correspondence can be proved for full HOPLA by making use of the path semantics to get a logical relations proof off the ground. We’ll use the notation J−K for the pat...
متن کامل